A Computable Error Bound for Matrix Functionals
نویسنده
چکیده
Many problems in applied mathematics require the evaluation of matrix functionals of the form F(A) := u T f(A)u, where A is a large symmetric matrix and u is a vector. Golub and collaborators have described how approximations of such functionals can be computed inexpensively by using the Lanczos algorithm. The present note shows that error bounds for these approximations can be computed essentially for free when bounds for derivatives of f on an interval containing the spectrum of A are available.
منابع مشابه
Computability over The Partial Continuous Functionals
We show that to every recursive total continuous functional Φ there is a representative Ψ of Φ in the hierearchy of partial continuous functionals such that Ψ is S1 − S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative Ψ will be PCF -definable over the partial continuous functionals, where PCF is Plotkin’s programming language for computable func...
متن کاملGeneral Aspects of Trefftz Method and Relations to Error Estimation of Finite Element Approximations
In this paper a guaranteed upper bound of the global discretization error in linear elastic finite element approximations is presented, based on a generalized Trefftz functional. Therefore, the general concept of complementary energy functionals and the corresponding approximation methods of Ritz, Trefftz, the method of orthogonal projection and the hypercircle method are briefly outlined. Furt...
متن کاملComputable backward error bounds for basic algorithms in linear algebra
Standard error estimates in numerical linear algebra are often of the form γk|R||S| where R,S are known matrices and γk := ku/(1−u) with u denoting the relative rounding error unit. Recently we showed that for a number of standard problems γk can be replaced by ku for any order of computation and without restriction on the dimension. Such problems include LUand Cholesky decomposition, triangula...
متن کاملA Posteriori Error Analysis of Parameterized Linear Systems Using Spectral Methods
We develop computable a posteriori error estimates for the pointwise evaluation of linear functionals of a solution to a parameterized linear system of equations. These error estimates are based on a variational analysis applied to polynomial spectral methods for forward and adjoint problems. We also use this error estimate to define an improved linear functional and we prove that this improved...
متن کاملRobust stability of fuzzy Markov type Cohen-Grossberg neural networks by delay decomposition approach
In this paper, we investigate the delay-dependent robust stability of fuzzy Cohen-Grossberg neural networks with Markovian jumping parameter and mixed time varying delays by delay decomposition method. A new Lyapunov-Krasovskii functional (LKF) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...
متن کامل